Parallel Graph Reduction with the h ; Gi -
نویسنده
چکیده
We have implemented a parallel graph reducer on a commercially available shared memory multiprocessor (a Sequent Symmetry TM ), that achieves real speedup compared to a a fast compiled implementation of the conventional Gmachine. Using 15 processors, this speedup ranges between 5 and 11, depending on the program. Underlying the implementation is an abstract machine called the h ; Gi-machine. We describe the sequential and the parallel h ; Gi-machine, and our implementation of them. We provide performance and speedup gures and graphs.
منابع مشابه
Parallel Graph Reduction with the h ; Gi - machine
We have implemented a parallel graph reducer on a commercially available shared memory multiprocessor (a Sequent Symmetry TM ), that achieves real speedup compared to a a fast compiled implementation of the conventional Gmachine. Using 15 processors, this speedup ranges between 5 and 11, depending on the program. Underlying the implementation is an abstract machine called the h ; Gi-machine. We...
متن کاملOn the Parallel Parameterized Complexity of the Graph Isomorphism Problem
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (GI) for several parameterizations. Let H = {H1,H2, · · · ,Hl} be a finite set of graphs where |V (Hi)| ≤ d for all i and for some constant d. Let G be an H-free graph class i.e., none of the graphs G ∈ G contain any H ∈ H as an induced subgraph. We show that GI parameterized by vertex deletion distan...
متن کاملLocality and False Sharing in Coherent-Cache Parallel Graph Reduction
Parallel graph reduction is a model for parallel program execution in which shared-memory is used under a strict access regime with single assignment and blocking reads. We outline the design of an ee-cient and accurate multiprocessor simulation scheme and the results of a simulation study of the performance of a suite of benchmark programs operating under a cache coherency protocol that is rep...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملLocaltiy and False Sharing in Coherent-Cache Parallel Graph Reduction
Parallel graph reduction is a model for parallel program execution in which shared-memory is used under a strict access regime with single assignment and blocking reads. We outline the design of an ee-cient and accurate multiprocessor simulation scheme and the results of a simulation study of the performance of a suite of benchmark programs operating under a cache coherency protocol that is rep...
متن کامل